Importance sampling algorithms for the fork-join queue
نویسنده
چکیده
In this paper we consider a rare-event problem in the fork-join queue for which we develop an efficient importance sampling algorithm.
منابع مشابه
The M/M/1 Fork-Join Queue with Variable Sub-Tasks
The fork-join queue models parallel resources where arriving jobs divide into various number of sub-tasks that are assigned to unique devices within the parallel resource. Each device in the parallel resource is modeled by M=M=1 queueing servers. A job completes execution and departs the parallel resource after all its sub-tasks complete execution. This paper analyzes N-server fork-join queues ...
متن کاملTwo Moment Approximations for Fork/Join Stations with Applications to Modeling Kanban Systems
In queuing models of kanban systems, fork/join stations are used to model the synchronization constraints between parts and kanbans. Efficient analysis of these fork/join stations is quite crucial to analytical performance evaluation of kanban systems. Exact analysis of the fork/join station can be difficult especially if the input processes have general characteristics. We propose a new method...
متن کاملA Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System
.-\.0. iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/ join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. However, it gives results which are an upper bound of ...
متن کاملResponse Time Approximations in Fork-Join Queues
Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing...
متن کاملAnalysis of a Fork/Join Synchronization Station with Inputs from Coxian Servers in a Closed Queuing Network
Fork/join stations are commonly used to model the synchronization constraints in queuing models of computer networks, fabrication/assembly systems and material control strategies for manufacturing systems. This paper presents an exact analysis of a fork/join station in a closed queuing network with inputs from servers with two-phase Coxian service distributions, which models a wide range of var...
متن کامل